Bootstrap Tests: How Many Bootstraps?
نویسندگان
چکیده
In practice, bootstrap tests must use a finite number of bootstrap samples. This means that the outcome of the test will depend on the sequence of random numbers used to generate the bootstrap samples, and it necessarily results in some loss of power. We examine the extent of this power loss and propose a simple pretest procedure for choosing the number of bootstrap samples so as to minimize experimental randomness. Simulation experiments suggest that this procedure will work very well in practice.
منابع مشابه
Statistical Applications in Genetics and Molecular Biology
It is a common practice to use resampling methods such as the bootstrap for calculating the p-value for each test when performing large scale multiple testing. The precision of the bootstrap p-values and that of the false discovery rate (FDR) relies on the number of bootstraps used for testing each hypothesis. Clearly, the larger the number of bootstraps the better the precision. However, the r...
متن کاملSome Converse Limit Theorems for Exchangeable Bootstraps
The bootstrap Glivenko-Cantelli and bootstrap Donsker theorems of Giné and Zinn (1990) contain both necessary and sufficient conditions for the asymptotic validity of Efron’s nonparametric bootstrap. In the more general case of exchangeably weighted bootstraps, Praestgaard and Wellner (1993) and Van der Vaart and Wellner (1996) give analogues of the sufficiency half of the Theorems of Giné and ...
متن کاملBootstrapping clustered data
Various bootstraps have been proposed for bootstrapping clustered data from one-way arrays. The simulation results in the literature suggest that some of these methods work quite well in practice; the theoretical results are limited and more mixed in their conclusions. For example, McCullagh reached negative conclusions about the use of non-parametric bootstraps for one-way arrays. The purpose ...
متن کاملHIGHER-ORDER IMPROVEMENTS OF A COMPUTATIONALLY ATTRACTIVE k-STEP BOOTSTRAP FOR EXTREMUM ESTIMATORS
This paper establishes the higher-order equivalence of the k-step bootstrap, introduced recently by Davidson and MacKinnon (1999), and the standard bootstrap. The k-step bootstrap is a very attractive alternative computationally to the standard bootstrap for statistics based on nonlinear extremum estimators, such as generalized method of moment and maximum likelihood estimators. The paper also ...
متن کاملHIGHER-ORDER IMPROVEMENTS OF A COMPUTATIONALLY ATTRACTIVE k-STEP BOOTSTRAP FOR EXTREMUM ESTIMATORS By
1 This paper establishes the higher-order equivalence of the k-step bootstrap, introduced recently by Davidson and MacKinnon (1999), and the standard bootstrap. The k-step bootstrap is a very attractive alternative computationally to the standard bootstrap for statistics based on nonlinear extremum estimators, such as generalized method of moment and maximum likelihood estimators. The paper als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997